Numerical Solution of the Stationary Schrr Odinger Equation Using Finite Element Methods on Sparse Grids 1 the Sparse Grid Finite Element Method
نویسنده
چکیده
Sparse grid methods applied to solve partial diierential equations allow for a substantial reduction of numerical eeort (to obtain equal error magnitudes) compared to conventional nite element methods. The stationary Schrr odinger equation is solved numerically for a number of model problems and the results are compared to both exact values and numerical computations of other authors. For problems with an oscillator potential (harmonic or anharmonic), the accuracy of eigenvalues for given number of grid points and given order of basis functions is increased by up to two orders of magnitude with respect to conventional FEM. Good solutions were obtained for singular potentials (hydrogen atom and hydrogen molecular ion), where the sparse grid was automatically reened in a local adapation strategy. Schrr odinger problems of very high dimension (6) become tractable with this algorithm. None of the results depends on symmetries or separabilities of the potentials, i.e. similar accuracies are to be expected for arbitrary potential functions. Numerical methods for the solution of partial diierential equations are ubiquitous in physics as well as in other sciences. Recently, nite element methods (FEM) have proved to be exible, dependable tools for various problems in such elds as technical mechanics, hydrodynamics, or atomic and molecular physics. In many cases they are superior to other algorithms with respect to numerical eeciency. A new variant of FEM, the sparse grid nite element method, was developed by Zenger 2] in 1990. It allows for massive reduction of the amount of storage needed to solve a problem with given accuracy. After having proved useful for computations of solutions of Laplace's and Poisson's equations and of eigen-states of Helmholtz's equation, the sparse grid FEM is applied to the stationary Schrr odinger equation in this work.
منابع مشابه
Sparse Grid Tutorial
The sparse grid method is a special discretization technique, which allows to cope with the curse of dimensionality of grid based approaches to some extent. It is based on a hierarchical basis [Fab09, Yse86, Yse92], a representation of a discrete function space which is equivalent to the conventional nodal basis, and a sparse tensor product construction. The method was originally developed for ...
متن کاملConcepts for higher order finite elements on sparse grids
On the way to an efficient implementation of finite element algorithms related to the pand h-p-versions on sparse grids, we present a general concept for the construction of hierarchical bases of higher order suitable for sparse grid methods. For the solution of partial differential equations, this approach allows us to profit both from the efficiency of sparse grid discretizations and from the...
متن کاملAdaptive Unstructured Grid Generation Scheme for Solution of the Heat Equation
An adaptive unstructured grid generation scheme is introduced to use finite volume (FV) and finite element (FE) formulation to solve the heat equation with singular boundary conditions. Regular grids could not acheive accurate solution to this problem. The grid generation scheme uses an optimal time complexity frontal method for the automatic generation and delaunay triangulation of the grid po...
متن کاملModified Fixed Grid Finite Element Method in the Analysis of 2D Linear Elastic Problems
In this paper, a modification on the fixed grid finite element method is presented and used in the solution of 2D linear elastic problems. This method uses non-boundary-fitted meshes for the numerical solution of partial differential equations. Special techniques are required to apply boundary conditions on the intersection of domain boundaries and non-boundary-fitted elements. Hence, a new met...
متن کاملExplicit Construction of Gmrf Approximations to Generalised Matérn Fields on Irregular Grids
Models based on stationary covariance functions, such as the Matérn family, are commonly used in spatial statistics. For large grid resolutions, the computational effort can be substantial, as well as the memory requirements. A solution to this problem is to approximate the stationary covariances with aMarkov random field model on the grid. This report contains the theoretical basis for one suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994